traversing binary tree meaning in Chinese

遍历二叉树

A discussion of postorder - traverse binary tree with no - recursive algorithm
递归算法的非递归化研究
The recursive and non - recursive algorithm of post - traversing binary tree
二叉树后序遍历的递归和非递归算法
Traversing binary tree
遍历二叉树
According to binary tree level traversal principle , this article embarks from fully binary tree ' s definition and the nature , and proposes a method to judge fully binary tree on the basis of traversing binary tree
摘要从完全二叉树的定义及性质出发，根据二叉树的层次遍历原则，提出了一种遍历法判断完全二叉树的方法。
It presents the arithmetic that is achieved by postorder traversing binary tree , which is built from aov diagraph , based on investigating the arithmetic of interchanging between the ladder diagram and instruction list , and the interpretation and execution of plc programming language . the whole software is developed in visual c + + ide with mfc and multi - threads mechanism . the software is well constructed and conforms to a standard of iec61131
在重点研究了编程软件中梯形图与指令表程序的转换算法以及指令解释执行的原理和方法的基础上,提出了由aov有向图建立二叉树、并对其进行后序遍历来实现梯形图程序与指令表程序转换的算法,并给出了算法在编程软件中的具体实现。